________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:57:36
Input Data from:  dataset145.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,064
Average f[i]   :4825
Average g[i,j] :1923,52941176471
Total demand   :5470
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	910	1	-1	8	6500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 910


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 84
> Selected Move:	1310	1	-1	19	12000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1    >new incumb.: 1310


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 97
> Selected Move:	1680	1	-1	15	16500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1    >new incumb.: 1680


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 108
> Selected Move:	1980	1	-1	10	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  1    >new incumb.: 1980


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 104
> Selected Move:	1960	3	10	5	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 105
> Selected Move:	1940	3	5	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 105
> Selected Move:	1910	3	14	16	21000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 109
> Selected Move:	2090	1	-1	18	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  1  1    >new incumb.: 2090


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 71
> Selected Move:	2080	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 73
> Selected Move:	2040	3	19	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 82
> Selected Move:	2050	3	12	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 81
> Selected Move:	1970	3	7	5	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 86
> Selected Move:	1960	3	16	12	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 91
> Selected Move:	1940	3	8	17	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 77
> Selected Move:	1970	3	5	19	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 74
> Selected Move:	1980	3	12	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  1  1  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 81
> Selected Move:	1990	3	17	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 75
> Selected Move:	1980	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 77
> Selected Move:	1960	3	11	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 84
> Selected Move:	2020	3	12	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 55
> Selected Move:	1980	3	15	12	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 59
> Selected Move:	1940	3	10	15	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 104
> Selected Move:	1970	3	1	17	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  1  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 61
> Selected Move:	1980	3	12	16	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  0  0  0  0  1  1  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 62
> Selected Move:	1950	3	17	1	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 106
> Selected Move:	1970	3	5	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 91
> Selected Move:	1930	3	10	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  1  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 83
> Selected Move:	1920	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 85
> Selected Move:	1880	3	14	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 102
> Selected Move:	1900	3	19	5	24500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 102
> Selected Move:	1910	3	12	16	24500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 99
> Selected Move:	1950	3	3	17	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 93
> Selected Move:	1940	3	5	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 101
> Selected Move:	1950	3	17	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 107
> Selected Move:	1940	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 110
> Selected Move:	1930	3	11	17	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 101
> Selected Move:	1920	3	17	10	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 105
> Selected Move:	1980	3	12	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  1  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 76
> Selected Move:	1940	3	15	12	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 84
> Selected Move:	1900	3	10	15	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 107
> Selected Move:	1935	3	12	8	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 70
> Selected Move:	1978	3	7	19	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 62
> Selected Move:	1960	3	8	17	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 66
> Selected Move:	1940	2	18	-1	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 102
> Selected Move:	1900	3	15	12	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 106
> Selected Move:	1928	1	-1	18	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 74
> Selected Move:	1950	3	17	8	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 47 #######################


> Neighbours evaluated; 71
> Selected Move:	1920	2	18	-1	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 48 #######################


> Neighbours evaluated; 109
> Selected Move:	1940	3	5	10	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 49 #######################


> Neighbours evaluated; 109
> Selected Move:	1900	3	10	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 50 #######################


> Neighbours evaluated; 108
> Selected Move:	1900	3	14	15	21000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 51 #######################


> Neighbours evaluated; 112
> Selected Move:	1900	3	12	3	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 52 #######################


> Neighbours evaluated; 105
> Selected Move:	1940	3	19	10	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 53 #######################


> Neighbours evaluated; 107
> Selected Move:	1940	3	3	7	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 54 #######################


> Neighbours evaluated; 110
> Selected Move:	1920	3	10	5	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 55 #######################


> Neighbours evaluated; 112
> Selected Move:	1920	3	7	3	22500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 56 #######################


> Neighbours evaluated; 107
> Selected Move:	1900	3	8	17	22500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 57 #######################


> Neighbours evaluated; 104
> Selected Move:	1900	3	3	7	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 58 #######################


> Neighbours evaluated; 106
> Selected Move:	1940	1	-1	18	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 59 #######################


> Neighbours evaluated; 80
> Selected Move:	1910	3	17	16	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 60 #######################


> Neighbours evaluated; 107
> Selected Move:	1940	3	1	17	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  0  0  0  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 61 #######################


> Neighbours evaluated; 95
> Selected Move:	1930	3	16	12	25000


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  0  0  1  0  0  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 62 #######################


> Neighbours evaluated; 95
> Selected Move:	1882	3	17	8	25300


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  0  0  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 63 #######################


> Neighbours evaluated; 95
> Selected Move:	1924	3	7	19	25300


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  3  0  0  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 64 #######################


> Neighbours evaluated; 84
> Selected Move:	1935	3	12	16	25300


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  3  0  0  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 65 #######################


> Neighbours evaluated; 89
> Selected Move:	1897	3	19	7	25300


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  0  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 66 #######################


> Neighbours evaluated; 100
> Selected Move:	1820	3	8	11	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  0  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 95
> Selected Move:	1859	3	7	19	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  3  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 68 #######################


> Neighbours evaluated; 86
> Selected Move:	1848	3	16	12	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  3  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 69 #######################


> Neighbours evaluated; 90
> Selected Move:	1807	3	19	7	25200


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  0  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 70 #######################


> Neighbours evaluated; 100
> Selected Move:	1732	3	11	10	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  3  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 71 #######################


> Neighbours evaluated; 67
> Selected Move:	1770	3	7	19	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 72 #######################


> Neighbours evaluated; 57
> Selected Move:	1778	3	12	16	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 73 #######################


> Neighbours evaluated; 56
> Selected Move:	1736	3	19	7	25400


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  3  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 74 #######################


> Neighbours evaluated; 66
> Selected Move:	1670	2	18	-1	21400


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  0  0  3  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 75 #######################


> Neighbours evaluated; 97
> Selected Move:	1860	3	16	8	23400


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  0  3  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 76 #######################


> Neighbours evaluated; 90
> Selected Move:	1900	3	7	19	23400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  3  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 77 #######################


> Neighbours evaluated; 74
> Selected Move:	1900	4	10	5	24300


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  1  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 78 #######################


> Neighbours evaluated; 64
> Selected Move:	1900	4	5	8	22800


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  3  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 79 #######################


> Neighbours evaluated; 82
> Selected Move:	1900	4	8	15	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  1  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 80 #######################


> Neighbours evaluated; 59
> Selected Move:	1900	4	15	19	23800


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 81 #######################


> Neighbours evaluated; 85
> Selected Move:	1890	3	10	17	24300


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 82 #######################


> Neighbours evaluated; 71
> Selected Move:	1890	4	19	5	24800


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 83 #######################


> Neighbours evaluated; 67
> Selected Move:	1890	4	5	8	23300


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  3  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 84 #######################


> Neighbours evaluated; 90
> Selected Move:	1890	4	8	17	23000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 85 #######################


> Neighbours evaluated; 93
> Selected Move:	1890	3	8	11	23000


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 86 #######################


> Neighbours evaluated; 89
> Selected Move:	1890	4	17	5	24800


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 87 #######################


> Neighbours evaluated; 66
> Selected Move:	1890	4	5	11	23200


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  3  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 88 #######################


> Neighbours evaluated; 84
> Selected Move:	1890	4	11	19	24300


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 89 #######################


> Neighbours evaluated; 69
> Selected Move:	1870	3	11	10	23800


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 90 #######################


> Neighbours evaluated; 56
> Selected Move:	1870	4	19	5	24300


> New Y[]: 
	
	 2  0  4  0  0  3  0  0  0  0  1  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 91 #######################


> Neighbours evaluated; 54
> Selected Move:	1870	4	5	10	23400


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  3  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 92 #######################


> Neighbours evaluated; 60
> Selected Move:	1870	4	10	15	24700


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  0  0  0  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 93 #######################


> Neighbours evaluated; 48
> Selected Move:	1870	4	15	17	22500


> New Y[]: 
	
	 2  0  4  0  0  1  0  0  0  0  1  0  0  0  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 94 #######################


> Neighbours evaluated; 71
> Selected Move:	1840	3	17	1	21000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 95 #######################


> Neighbours evaluated; 95
> Selected Move:	1953	1	-1	16	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 96 #######################


> Neighbours evaluated; 66
> Selected Move:	1960	3	10	8	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 97 #######################


> Neighbours evaluated; 72
> Selected Move:	1955	3	16	12	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 98 #######################


> Neighbours evaluated; 73
> Selected Move:	1950	3	8	10	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 99 #######################


> Neighbours evaluated; 70
> Selected Move:	1945	3	10	17	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 100 #######################


> Neighbours evaluated; 71
> Selected Move:	1950	3	12	16	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 101 #######################


> Neighbours evaluated; 71
> Selected Move:	1905	3	19	7	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 102 #######################


> Neighbours evaluated; 78
> Selected Move:	1920	3	17	8	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 103 #######################


> Neighbours evaluated; 86
> Selected Move:	1913	3	8	10	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 104 #######################


> Neighbours evaluated; 77
> Selected Move:	1930	3	5	18	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  1  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 105 #######################


> Neighbours evaluated; 110
> Selected Move:	1890	3	10	14	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 106 #######################


> Neighbours evaluated; 111
> Selected Move:	1880	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 107 #######################


> Neighbours evaluated; 111
> Selected Move:	1840	3	14	13	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 108 #######################


> Neighbours evaluated; 112
> Selected Move:	1900	3	7	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 109 #######################


> Neighbours evaluated; 112
> Selected Move:	1910	3	12	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 110 #######################


> Neighbours evaluated; 105
> Selected Move:	1890	3	8	19	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 111 #######################


> Neighbours evaluated; 109
> Selected Move:	1890	3	13	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 112 #######################


> Neighbours evaluated; 108
> Selected Move:	1880	3	3	6	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 113 #######################


> Neighbours evaluated; 107
> Selected Move:	1840	3	19	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 114 #######################


> Neighbours evaluated; 111
> Selected Move:	1850	3	6	13	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  0  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 115 #######################


> Neighbours evaluated; 108
> Selected Move:	1870	3	7	17	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  1  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 116 #######################


> Neighbours evaluated; 107
> Selected Move:	1860	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 117 #######################


> Neighbours evaluated; 104
> Selected Move:	1880	3	17	19	24000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 118 #######################


> Neighbours evaluated; 105
> Selected Move:	1860	3	12	8	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 119 #######################


> Neighbours evaluated; 88
> Selected Move:	1900	2	18	-1	22000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 120 #######################


> Neighbours evaluated; 105
> Selected Move:	1890	3	13	17	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 121 #######################


> Neighbours evaluated; 108
> Selected Move:	1890	3	8	11	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 122 #######################


> Neighbours evaluated; 111
> Selected Move:	1890	3	15	5	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,195

## ITERATION 123 #######################


> Neighbours evaluated; 102
> Selected Move:	1890	3	11	8	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 124 #######################


> Neighbours evaluated; 104
> Selected Move:	1890	3	17	10	23000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 125 #######################


> Neighbours evaluated; 107
> Selected Move:	1870	3	5	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 126 #######################


> Neighbours evaluated; 110
> Selected Move:	1870	3	6	14	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 127 #######################


> Neighbours evaluated; 107
> Selected Move:	1840	3	14	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 128 #######################


> Neighbours evaluated; 108
> Selected Move:	1870	3	10	12	23000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 129 #######################


> Neighbours evaluated; 116
> Selected Move:	1860	3	4	3	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 130 #######################


> Neighbours evaluated; 115
> Selected Move:	1900	3	19	10	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 131 #######################


> Neighbours evaluated; 118
> Selected Move:	1900	3	3	7	22500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 132 #######################


> Neighbours evaluated; 118
> Selected Move:	1880	3	10	5	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 133 #######################


> Neighbours evaluated; 115
> Selected Move:	1995	1	-1	15	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 134 #######################


> Neighbours evaluated; 112
> Selected Move:	1990	3	15	18	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 135 #######################


> Neighbours evaluated; 118
> Selected Move:	1973	3	8	17	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 136 #######################


> Neighbours evaluated; 115
> Selected Move:	1990	3	18	15	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 137 #######################


> Neighbours evaluated; 110
> Selected Move:	1958	3	17	10	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 138 #######################


> Neighbours evaluated; 112
> Selected Move:	1910	3	10	11	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 139 #######################


> Neighbours evaluated; 118
> Selected Move:	1945	3	7	19	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 140 #######################


> Neighbours evaluated; 107
> Selected Move:	1970	3	12	18	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 141 #######################


> Neighbours evaluated; 111
> Selected Move:	1945	3	18	16	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 142 #######################


> Neighbours evaluated; 105
> Selected Move:	1900	3	19	7	26000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 143 #######################


> Neighbours evaluated; 107
> Selected Move:	1923	3	16	18	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 144 #######################


> Neighbours evaluated; 110
> Selected Move:	1880	3	15	12	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 145 #######################


> Neighbours evaluated; 114
> Selected Move:	1918	3	7	19	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 146 #######################


> Neighbours evaluated; 106
> Selected Move:	1915	3	11	6	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 147 #######################


> Neighbours evaluated; 106
> Selected Move:	1873	3	12	16	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 148 #######################


> Neighbours evaluated; 106
> Selected Move:	1910	3	6	8	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 149 #######################


> Neighbours evaluated; 105
> Selected Move:	1890	3	5	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 150 #######################


> Neighbours evaluated; 115
> Selected Move:	1875	3	18	15	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 151 #######################


> Neighbours evaluated; 114
> Selected Move:	1850	3	8	10	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 152 #######################


> Neighbours evaluated; 112
> Selected Move:	1830	3	10	5	24000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  0  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 153 #######################


> Neighbours evaluated; 107
> Selected Move:	1860	3	12	7	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 154 #######################


> Neighbours evaluated; 108
> Selected Move:	1850	3	16	12	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 155 #######################


> Neighbours evaluated; 107
> Selected Move:	1810	3	12	18	24500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 156 #######################


> Neighbours evaluated; 106
> Selected Move:	1845	3	7	6	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 157 #######################


> Neighbours evaluated; 99
> Selected Move:	1838	3	6	3	25500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 158 #######################


> Neighbours evaluated; 103
> Selected Move:	1800	3	3	9	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 159 #######################


> Neighbours evaluated; 104
> Selected Move:	1790	3	19	7	25000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 160 #######################


> Neighbours evaluated; 109
> Selected Move:	1815	3	9	6	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 161 #######################


> Neighbours evaluated; 109
> Selected Move:	1868	3	15	12	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 162 #######################


> Neighbours evaluated; 114
> Selected Move:	1830	3	12	16	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 163 #######################


> Neighbours evaluated; 114
> Selected Move:	1868	3	6	8	25500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 164 #######################


> Neighbours evaluated; 111
> Selected Move:	1850	3	5	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 165 #######################


> Neighbours evaluated; 122
> Selected Move:	1833	3	18	15	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 166 #######################


> Neighbours evaluated; 114
> Selected Move:	1870	2	12	-1	21000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 167 #######################


> Neighbours evaluated; 115
> Selected Move:	1900	3	16	14	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 168 #######################


> Neighbours evaluated; 115
> Selected Move:	1860	3	14	12	21000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 169 #######################


> Neighbours evaluated; 111
> Selected Move:	1860	3	7	3	22000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 170 #######################


> Neighbours evaluated; 114
> Selected Move:	1880	3	15	5	22500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 171 #######################


> Neighbours evaluated; 112
> Selected Move:	1860	3	8	17	22500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 172 #######################


> Neighbours evaluated; 110
> Selected Move:	1860	3	3	7	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 173 #######################


> Neighbours evaluated; 113
> Selected Move:	1850	3	12	8	23500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 174 #######################


> Neighbours evaluated; 109
> Selected Move:	1860	3	7	15	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 175 #######################


> Neighbours evaluated; 101
> Selected Move:	1860	3	0	19	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 176 #######################


> Neighbours evaluated; 48
> Selected Move:	1860	4	19	5	24800


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,185

## ITERATION 177 #######################


> Neighbours evaluated; 47
> Selected Move:	1860	4	5	8	23800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  2  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 178 #######################


> Neighbours evaluated; 54
> Selected Move:	1860	4	8	17	23800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  1  0  0  0  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,175

## ITERATION 179 #######################


> Neighbours evaluated; 61
> Selected Move:	1860	3	8	11	23800


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  2  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,17

## ITERATION 180 #######################


> Neighbours evaluated; 41
> Selected Move:	1860	4	17	5	24800


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 181 #######################


> Neighbours evaluated; 35
> Selected Move:	1860	4	5	11	23200


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  2  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 182 #######################


> Neighbours evaluated; 47
> Selected Move:	1860	4	11	19	24300


> New Y[]: 
	
	 0  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 183 #######################


> Neighbours evaluated; 42
> Selected Move:	1860	3	19	0	22500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 184 #######################


> Neighbours evaluated; 104
> Selected Move:	1860	3	2	19	24900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,145

## ITERATION 185 #######################


> Neighbours evaluated; 65
> Selected Move:	1860	4	19	5	24500


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  0  0  0  1  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,14

## ITERATION 186 #######################


> Neighbours evaluated; 63
> Selected Move:	1860	4	5	11	23300


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  4  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,135

## ITERATION 187 #######################


> Neighbours evaluated; 78
> Selected Move:	1860	4	11	17	23800


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,13

## ITERATION 188 #######################


> Neighbours evaluated; 75
> Selected Move:	1860	3	11	8	23800


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,125

## ITERATION 189 #######################


> Neighbours evaluated; 90
> Selected Move:	1860	4	17	5	24500


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  1  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,12

## ITERATION 190 #######################


> Neighbours evaluated; 81
> Selected Move:	1860	4	5	8	23200


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  0  0  0  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,115

## ITERATION 191 #######################


> Neighbours evaluated; 92
> Selected Move:	1860	4	8	19	24900


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,11

## ITERATION 192 #######################


> Neighbours evaluated; 78
> Selected Move:	1850	3	19	3	24000


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,105

## ITERATION 193 #######################


> Neighbours evaluated; 90
> Selected Move:	1850	4	3	8	24200


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  4  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 88
> Selected Move:	1850	4	8	17	24800


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 195 #######################


> Neighbours evaluated; 87
> Selected Move:	1850	3	3	7	23800


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 99
> Selected Move:	1850	4	17	5	24500


> New Y[]: 
	
	 2  3  0  0  0  4  0  1  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 92
> Selected Move:	1850	4	5	7	24700


> New Y[]: 
	
	 2  3  0  0  0  1  0  4  1  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 89
> Selected Move:	1850	4	7	8	23200


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 199 #######################


> Neighbours evaluated; 97
> Selected Move:	1878	1	-1	12	27700


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  4  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 200 #######################


> Neighbours evaluated; 108
> Selected Move:	1891	3	7	19	27700


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  0  0  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0649999999999996

## ITERATION 201 #######################


> Neighbours evaluated; 104
> Selected Move:	1927	3	17	18	25200


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  0  0  1  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 202 #######################


> Neighbours evaluated; 112
> Selected Move:	1938	3	12	16	25200


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  0  0  0  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 203 #######################


> Neighbours evaluated; 112
> Selected Move:	1949	3	18	10	27200


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  1  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 204 #######################


> Neighbours evaluated; 86
> Selected Move:	1928	3	10	17	27700


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0649999999999996

## ITERATION 205 #######################


> Neighbours evaluated; 102
> Selected Move:	1908	3	8	11	27800


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  4  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0699999999999996

## ITERATION 206 #######################


> Neighbours evaluated; 87
> Selected Move:	1884	3	16	12	27800


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  4  1  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,0749999999999996

## ITERATION 207 #######################


> Neighbours evaluated; 87
> Selected Move:	1868	3	12	18	27300


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  4  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0799999999999996
________________________________________________________________

Best solution found: 2090
Run Termination time: 31.01.2010 10:59:57
Run duration: 00:02:21.4531250
________________________________________________________________
